/*
*	ID : pallab81
* 	PROG : Palindrome
* 	LANG : C++
* 	2012-07-07-20.30.35 Saturday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/

#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

template<class T1>
inline void debug(T1 _x) {
    cout<<_x<<'\n';
}
template<class T1, class T2>
inline void debug(T1 _x,T2 _y) {
    cout<<_x<<' '<<_y<<'\n';
}
template<class T1, class T2, class T3>
inline void debug(T1 _x,T2 _y,T3 _z) {
    cout<<_x<<' '<<_y<<' '<<_z<<'\n';
}
template<class T1, class T2, class T3, class T4>
inline void debug(T1 _x,T2 _y,T3 _z,T4 _zz) {
    cout<<_x<<' '<<_y<<' '<<_z<<' '<<_zz<<'\n';
}
template< class T1>
inline void debug(T1 _array,int _size) {
    cout<<"[";
    for (int i=0; i<_size; ++i) {
        cout<<' '<<_array[i];
    }
    puts(" ]");
}
inline bool CI(int &_x) {
    return scanf("%d",&_x)==1;
}
inline bool CI(int &_x, int &_y) {
    return CI(_x)&&CI(_y) ;
}
inline bool CI(int &_x, int &_y, int &_z) {
    return CI(_x)&&CI(_y)&&CI(_z) ;
}
inline bool CI(int &_x, int &_y, int &_z, int &_zz) {
    return CI(_x)&&CI(_y)&&CI(_z)&&CI(_zz) ;
}
inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ) {
        ;
    }
}

//<library cut>
/*
    YET ANOTHER INTERESTING USACO PROBLEM
    FINDING LONGEST PALINDROMIC STRING IN LINEAR TIME
    WRITTEN BY
        Brian Bi (bbi5291)
*/
const int mxn = 2000000;
char seq[mxn+5];
int LEN;
int out[mxn+5];
inline void Proc() {
    int seqLen = strlen(seq);
    int i=0,j,d,s,e,lLen,k=0;
    int palLen=0;
    LEN = seqLen;
    memset(&out,0,sizeof(out));
    while (i<seqLen) {
        if (i>palLen && seq[i-palLen-1]==seq[i]) {
            palLen+=2;
            i++;
            continue;
        }
        out[k++]=palLen;
        s=k-2;
        e=s-palLen;
        bool b=true;
        for (j=s; j>e; j--) {
            d=j-e-1;
            if (out[j]==d) {
                palLen=d;
                b=false;
                break;
            }
            out[k++]=min(d,out[j]);
        }
        if (b) {
            palLen=1;
            i++;
        }
    }
    out[k++]=palLen;
    lLen=k;
    s=lLen-2;
    e=s-(2*seqLen+1-lLen);
    for (i=s; i>e; i--) {
        d=i-e-1;
        out[k++]=min(d,out[i]);
    }
    int bst=0;
    fo(i,LEN*2) {
        bst=max(bst,out[i]);
    }
    cout<<bst<<'\n';
}
//</librabry cut>

#define KASE
int main() {
#ifndef ONLINE_JUDGE
    freopen("in","rt",stdin);
#endif
    int kase=1;
    while( gets(seq) ) {
        if( strcmp(seq,"END")==0 )break;
#ifdef KASE
        cout<<"Case "<<kase++<<": ";
#endif
        Proc();
    }

    return 0;
}